Stream Aggregation with Compressed Sliding-Windows

نویسندگان

چکیده

High performance stream aggregation is critical for many emerging applications that analyze massive volumes of data. Incoming data needs to be stored in a sliding window during processing, case the functions cannot computed incrementally. Updating with new incoming values and reading it feed are two primary steps aggregation. Although updates can supported efficiently using multi-level queues, frequent aggregations remain bottleneck as they put tremendous pressure on memory bandwidth capacity. This article addresses this problem by enhancing StreamZip, dataflow engine able compress windows. StreamZip deals number control dependency challenges integrate compressor pipeline alleviate posed aggregations. In addition, incorporates caching mechanism dealing skewed-key distributions stream. doing so, offers higher throughput well larger effective capacity support problems. supports diverse compression algorithms offering both lossless lossy integers floating-point numbers. Compared designs without compression, achieve up 7.5× 22× throughput, while improving 5× 23×, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Stream Mining with Multiple sliding Windows for continuous Prediction

Data stream mining (DSM) deals with continuous online processing and evaluation of fastaccumulating data, in cases where storing and evaluating large historical datasets is neither feasible nor efficient. This research introduces the Multiple Sliding Windows (MSW) algorithm, and demonstrates its application for a DSM scenario with discrete independent variables and a continuous dependent variab...

متن کامل

Reducing Data Stream Sliding Windows by Cyclic Tree-Like Histograms

Data reduction is a basic step in a KDD process useful for delivering to successive stages more concise and meaningful data. When mining is applied to data streams, that are continuous data flows, the issue of suitably reducing them is highly interesting, in order to arrange effective approaches requiring multiple scans on data, that, in such a way, may be performed over one or more reduced sli...

متن کامل

Subsuming Multiple Sliding Windows for Shared Stream Computation

Shared evaluation of multiple user requests is an utmost priority for stream processing engines in order to achieve high throughput and provide timely results. Given that most continuous queries specify windowing constraints, we suggest a multi-level scheme for concurrent evaluation of time-based sliding windows seeking for potential subsumptions among them. As requests may be registered or sus...

متن کامل

Sliding Windows with Limited Storage

We consider time-space tradeoffs for exactly computing frequency moments and order statistics over sliding windows [16]. Given an input of length 2n− 1, the task is to output the function of each window of length n, giving n outputs in total. Computations over sliding windows are related to direct sum problems except that inputs to instances almost completely overlap. • We show an average case ...

متن کامل

Accelerating Genomic Analyses with Parallel Sliding Windows

In recent years biology has become an information science, where an avalanche of newly sequenced genomic data has overwhelmed our existing analysis and mining tools. This paper addresses this challenge by developing a systematic way of speeding up a broad class of bioinformatics algorithms using commodity graphics processing hardware. Using the example problem of analyzing DNA structural variat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Reconfigurable Technology and Systems

سال: 2023

ISSN: ['1936-7414', '1936-7406']

DOI: https://doi.org/10.1145/3590774